Energetic Extended Edge Finding Filtering Algorithm for Cumulative Resource Constraints
نویسندگان
چکیده
منابع مشابه
AQuadratic Extended Edge-Finding Filtering Algorithm for Cumulative Resource Constraints∗
Edge-finding, extended edge-finding, not-first/not-last and energetic reasoning are well-known filtering rules used in constraint-based scheduling problems for propagating constraints over disjunctive and cumulative resources. In practice, these filtering algorithms frequently form part of a sequence to form a more powerful propagator, thereby helping to reduce search tree size. In this paper, ...
متن کاملTimetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
Edge Finding filtering algorithm is one of the reasons why Constraint Programming is a successful approach in the scheduling domain. However edge finding for cumulative resources was never as successful as edge finding for disjunctive resources. This paper presents a new variant of the edge finding algorithm which improves filtering by taking into account minimum capacity profile a data structu...
متن کاملTime-Table Extended-Edge-Finding for the Cumulative Constraint
We propose a new filtering algorithm for the cumulative constraint. It applies the Edge-Finding, the Extended-Edge-Finding and the Time-Tabling rules in O(kn logn) where k is the number of distinct task heights. By a proper use of tasks decomposition, it enforces the Time-Tabling rule and the Time-Table Extended-Edge-Finding rule. Thus our algorithm improves upon the best known Extended-Edge-Fi...
متن کاملEdge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten’s edge finder for cumulative scheduling, and its derivatives, are incomplete and use an invalid dominance rule. The paper then presents a new edgefinding algorithm for cumulative resources which runs in time O(nk), where n is the number of tasks and k the nu...
متن کاملEdge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n){\mathcal O}(kn {\rm log} n)
This paper presents new Edge Finding algorithm for discrete cumulative resources, i.e. resources which can process several activities simultaneously up to some maximal capacity C. The algorithm has better time complexity than the current version of this algorithm: O(kn log n) versusO(kn2) where n is number of activities on the resource and k is number of distinct capacity demands. Moreover the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Operations Research
سال: 2013
ISSN: 2160-8830,2160-8849
DOI: 10.4236/ajor.2013.36056